Center-oriented algorithms for the minimum energy broad and multicast problem in wireless ad hoc networks

Quickly finding low-energy multicast routings is vital for a wireless system’s energy efficiency. Therefore, key aspects for heuristics for the minimum energy multicast problem (MEMP) are time complexity (measured in the numbers |V | and |A| of networking devices and their possible power assignments, respectively) and deviation from optimum. Following a center-oriented approach, we develop the STSuS and STESuS algorithms (time complexity O(|V |2) and O(|V |2 log |V |), respectively), and analyze their performance in numerical simulations. They deviate from optimum by only ≈ 11% and ≈ 7.5%, respectively, and thereby outperform the well-known MIP (O(|V |2), ≈ 22% deviation) and many other algorithms significantly.